/*package test2;
二叉树的最大深度
public class demo48 {
    *//**
     * Definition for a binary tree node.
     * public class TreeNode {
     *     int val;
     *     TreeNode left;
     *     TreeNode right;
     *     TreeNode() {}
     *     TreeNode(int val) { this.val = val; }
     *     TreeNode(int val, TreeNode left, TreeNode right) {
     *         this.val = val;
     *         this.left = left;
     *         this.right = right;
     *     }
     * }
     *//*
    class Solution {
        public int maxDepth(TreeNode root) {
            int count1 = 0;
            int count2 = 0;
            if(root==null)
                return 0;
            else{
                count1 = maxDepth(root.left)+1;
                count2 = maxDepth(root.right)+1;
            }
            return Math.max(count1,count2);
        }
    }
}*/
